Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data

نویسندگان

  • Bernard M. E. Moret
  • Adam C. Siepel
  • Jijun Tang
  • Tao Liu
چکیده

Phylogeny reconstruction from gene-order data has attracted much attention over the last few years. The two software packages used for that purpose, BPAnalysis and GRAPPA, both use so-called breakpoint medians in their computations. Some of our past results indicate that using inversion scores rather than breakpoint scores in evaluating trees leads to the selection of better trees. On that basis, we conjectured that phylogeny reconstructions could be improved by using inversion medians, which minimize evolutionary distance under an inversionsonly model of genome rearrangement. Recent algorithmic developments have made it possible to compute inversion medians for problems of realistic size. Our experimental studies unequivocally show that inversion medians are strongly preferable to breakpoint medians in the context of phylogenetic reconstruction from gene-order data. Improvements are most pronounced in the reconstruction of ancestral genomes, but are also evident in the topological accuracy of the reconstruction as well as, surprisingly, in the overall running time. Improvements are strongest for small average distances along tree edges and for evolutionary scenarios with a preponderance of inversion events, but occur in all cases, including evolutionary scenarios with high proportions of transpositions. All of our tests were run using our GRAPPA package, available (under GPL) at www.cs.unm.edu/∼moret/GRAPPA/; the next release will include the inversion median software we used in this study. The software used includes RevMed, developed by the authors and available at www.cs.unm.edu/∼acs/, and A. Caprara’s inversion median code, generously made available for testing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding an Optimal Inversion Median: Experimental Results

We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree using simple geometric properties of the problem and a newly available linear-time routine for inversion distance. Our experiments on simulated data sets indicate that the algorithm finds optimal medians in reasonable tim...

متن کامل

Using median sets for inferring phylogenetic trees

MOTIVATION Algorithms for phylogenetic tree reconstruction based on gene order data typically repeatedly solve instances of the reversal median problem (RMP) which is to find for three given gene orders a fourth gene order (called median) with a minimal sum of reversal distances. All existing algorithms of this type consider only one median for each RMP instance even when a large number of medi...

متن کامل

An Empirical Comparison of Phylogenetic Methods on Chloroplast Gene Order Data in Campanulaceae

The first heuristic for reconstructing phylogenetic trees from gene order data was introduced by Blanchette et al.. It sought to reconstruct the breakpoint phylogeny and was applied to a variety of datasets. We present a new heuristic for estimating the breakpoint phylogeny which, although not polynomial-time, is much faster in practice than BPAnalysis. We use this heuristic to conduct a phylog...

متن کامل

Genome Rearrangement Phylogeny Using Weighbor

Evolution operates on whole genomes by operations that change the order and strandedness of genes within the genomes. This type of data presents new opportunities for discoveries about deep evolutionary rearrangement events. Several distance-based phylogenetic reconstruction methods have been proposed [12, 21, 19] that use neighbor joining (NJ) [16] with the expected breakpoint or inversion dis...

متن کامل

Breakpoint medians and breakpoint phylogenies: A fixed-parameter approach

With breakpoint distance, the genome rearrangement field delivered one of the currently most popular measures in phylogenetic studies for related species. Here, BREAKPOINT MEDIAN, which is NP-complete already for three given species (whose genomes are represented as signed orderings), is the core basic problem. For the important special case of three species, approximation (ratio 7/6) and exact...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002